Inverse Kinematics for Modular Reconfigurable Robots

نویسندگان

  • I-Ming Chen
  • Guilin Yang
چکیده

Inverse kinematics solutions of a reconfigurabie robot system built upon a collection of standardized components is dificult to obtain because of its varying configuration. This paper addresses the formulation of a generic numerical inverse kinematics model and automatic generation of the model for arbitrary robot geometry including serial type and branching type geometry. Both revolute and prismatic types of joints are considered. The inverse kinematics is obtained through the di@erential kinematics equations based on the Productof-exponential (POE) formulas. The Newton-Raphson iteration method is employed for solution. The automated model generation is accomplished through the introduction of Assembly Incidence Matrix (AIM) representation of a modular robot assembly configuration and the related accessibility matrix and path matrix. Examples of the inverse kinematics solutions for different types of modular robots are given to demonstrate the applicability and effectiveness of the proposed algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical inverse kinematics for modular reconfigurable robots

The inverse kinematics solutions of a reconfigurable robot system built upon a collection of standardized components is difficult to obtain because of its varying configurations. This article addresses the formulation of a generic numerical inverse kinematics model and automatic generation of the model for arbitrary robot geometry including serial and tree-typed geometries. Both revolute and pr...

متن کامل

CARV 2007 Task-based Configuration Optimization of Modular and Reconfigurable Robots using a Multi-solution Inverse Kinematics Solver

Modular and Reconfigurable Robots (MRR) are a breed of industrial robots designed for today’s flexible and versatile production facilities. MRRs can be assembled in various ways to achieve numerous distinct Kinematic configurations (KC). In MRRs, the problem of finding the most suitable KC for a specific task from a predefined set of modules is called Task-based Configuration Optimization (TBCO...

متن کامل

Docking in self-reconfigurable robots

Docking is a crucial action for self-reconfigurable robots because it supports almost all practical advantages of such robots. In addition to the classic docking challenges found in other applications, such as reliable dock/latch mechanics, effective guiding systems, and intelligent control protocols, docking in selfreconfigurable robots is also subject to some unique constraints. These constra...

متن کامل

Closed-Form Inverse Kinematics Solver for Reconfigurable Robots

|A closed-form inverse kinematics solver for non-redundant recon gurable robots is developed based on the Product-of-Exponentials (POE) formula. Its novelty lies in the use of POE reduction techniques and subproblems to obtain inverse kinematics solutions of a large number of possible con gurations in a systematic and convenient way. Three reduction techniques are introduced to simplify the POE...

متن کامل

Globally Convergent Optimal Dynamic Inverse Kinematics for Distributed Modular and Self-Reconfigurable Robot Trees

Kinematic trees of self-reconfigurable, modular robots are difficult to control for at least three primary reasons: (1) they must be controlled in a distributed fashion, (2) they are often kinematically redundant or hyper-redundant, and (3) in many cases, these robots must be designed to safely operate autonomously in dangerous and isolated environments. Much work has been done to design hardwa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998